Location:
Search - map coloring
Search list
Description: 地图染色问题，邻接矩阵从文件读入，但不会写文件去。-map coloring, the adjacency matrix from the document read, but not write to document.
Platform: |
Size: 1178 |
Author: 纵横四海 |
Hits:
Description: 地图着色的算法设计,具体代码没有实现,不过可以给大家一些参考-map coloring algorithm design, specific code did not come true, but I can give you some information! !
Platform: |
Size: 5920 |
Author: 萧鹏 |
Hits:
Description: 该程序是经典得MATLAB应用,关于模拟退火应用中得GCP图着色问题-the program MATLAB is a classic application of simulated annealing applications in the GCP map coloring problem
Platform: |
Size: 2990 |
Author: 王玥 |
Hits:
Description: 地图着色算法C语言实 任何平面地图可以使用4种颜色给每个不同的城市着色，而保证相邻的城市着不同的颜色。
-map coloring algorithm C language is any planar map can use four colors for each different city coloring, and adjacent to the city to ensure different color.
Platform: |
Size: 1735 |
Author: friday |
Hits:
Description: 四色图着色问题，离散数学的经典算法，用c实现，输入一个图，用小于4种颜色着色-four-color map coloring, Discrete Mathematics classical algorithm, using c realize that the importation of a map, with less than four colors Coloring
Platform: |
Size: 1340 |
Author: 司徒元 |
Hits:
Description: 模拟退火算法求解经典图论中的图着色问题的源程序-simulated annealing algorithm classic graph coloring map of the source
Platform: |
Size: 3072 |
Author: 黄大东 |
Hits:
Description: 用VC写的一个小程序，用数组代替解空间树，可以实现图用m种颜色着色的问题。-VC write a small program used to solve the spatial array to replace the tree, can achieve a map m colors coloring problems.
Platform: |
Size: 257024 |
Author: 蔡淑佳 |
Hits:
Description: 对地图的着色，找出最少的颜色数目。
对于颜色=3的时候，直接返回4.-The coloring on the map to find the least number of colors. For color = 3, when the direct return of 4.
Platform: |
Size: 8192 |
Author: 汗颜 |
Hits:
Description: 关于地图着色问题的蚁群搜索算法，启发式搜索算法的改进-Map Coloring Problem on ant colony search algorithm, heuristic search algorithm to improve
Platform: |
Size: 6144 |
Author: yurongguo |
Hits:
Description: I wrote this program for coloring any map with only 4 colors. Input for it is an bitmap file with 24 bit colors (must gray/scale). Output is a bitmap which is colored with maximum 4 colors.
Platform: |
Size: 1625088 |
Author: raveufo |
Hits:
Description: Very good collection of c++ source code. Implementation of diffrents alghoritms in graph theory, such as floyd,fulkerson. dijkstra,warshall, binary tree,map coloring,vertex cover.
Platform: |
Size: 10240 |
Author: croms |
Hits:
Description: 四色图着色问题，离散数学的经典算法，用c实现，输入一个图，用小于4种颜色着色-four-color map coloring, Discrete Mathematics classical algorithm, using c realize that the importation of a map, with less than four colors Coloring
Platform: |
Size: 1024 |
Author: la9190 |
Hits:
Description: 这个是地图染色问题的cpp文件，用c语言编写的-This is the map coloring problem cpp file, written in c language
Platform: |
Size: 9216 |
Author: amy |
Hits:
Description: 编程实现对澳大利亚地图进行着色，两个共同边界的区域染不同的颜色，当可以选择6、5、4、3种不同的颜色的情况下，由程序自动进行处理，给出具体的染色方案。-Color Australian map with different colors
Platform: |
Size: 1024 |
Author: 玥颖 |
Hits:
Description: 基于遗传算法的中国地图着色问题，额外给出省份名称与相邻关系的txt文件和中国地图的jpg图片文件-Map coloring problem based on genetic algorithms, province name is given txt file with neighboring relations, and China map jpg picture file
Platform: |
Size: 60416 |
Author: 王小兑 |
Hits:
Description: 用vc++开发编写的一个地图着色的程序，简单易于理解-Written vc++ development of a map coloring program, simple and easy to understand
Platform: |
Size: 1024 |
Author: 刘立芳 |
Hits:
Description: 全国地图着色，用最少的颜色给中国地图着色的MFC程序！-National map coloring, with a minimum of color to the Chinese map coloring MFC program!
Platform: |
Size: 13386752 |
Author: chenxiao |
Hits:
Description: 给地图着色，要求保证相邻的省份不能有相同的颜色的最少着色方案。-To map coloring, required to ensure the neighboring provinces can not have at least the same color coloring scheme.
Platform: |
Size: 6827008 |
Author: songnan |
Hits:
Description: 地图着色
1．以二维数组list[N+1] 表示地图，N表示区域数目，数组中以元素值为0表示不邻接，1表示邻接，限定区域数目N<=50.
2．用户先输入区域数目N，再输入邻接区域的代码，邻接可只写一次，区域的代码为0～N,N个为区域，一个为外部区域，或输入N-1,则可不包括外部区域，N个区域由用户定义
3．输出时，采用一一对应的方法，一个区域对应一种颜色
形式：区域代码＝＝》颜色代码（1～4）＝》颜色
4．本程序可为任意一张的地图染色，并且至多只染四种颜色
5．测试数据：当区域数目N=8,地图如下-Map coloring map
1. As a two-dimensional array list[N+1][N+1] said map, n denotes the number of regions, array element value of 0 indicates no adjacency, 1 represents the adjacency, limited number of regions N<=50.
2. The user to enter the region number n, then enter the region adjacent to the code, adjacent to write once, area code is 0 ~ n, n region, a regional external, or input n-1, can not including external areas and N zones by user defined
3 output, the use of one one corresponding method, a region corresponding to a color
Form: regional code = = color code (1 ~ 4) = color
4 this procedure can be any one of the map coloring, and at most only four colors
5 test data: when the number of the area N=8, the map is as follows
Platform: |
Size: 6263808 |
Author: 方太军 |
Hits:
Description: 中国地图省份填色 C#2013 winform-China Province map coloring
Platform: |
Size: 643072 |
Author: 钟俊鹏 |
Hits: